Grokking System Design Fundamentals
Rate this course
Ask Author
Contribute
Back to course home

68% completed

Vote For New Content
System Design Fundamentals
Introduction to System Design
Load Balancing
Introduction to Load Balancing
Load Balancing Algorithms
Uses of Load Balancing
Load Balancer Types
Stateless vs. Stateful Load Balancing
High Availability and Fault Tolerance
Scalability and Performance
Challenges of Load Balancers
API Gateway
Introduction to API Gateway
Usage of API gateway
Advantages and disadvantages of using API gateway
Key Characteristics of Distributed Systems
Scalability
Availability
Latency and Performance
Concurrency and Coordination
Monitoring and Observability
Resilience and Error Handling
Fault Tolerance vs. High Availability
Network Essentials
HTTP vs. HTTPS
TCP vs. UDP
HTTP: 1.0 vs. 1.1 vs 2.0 vs. 3.0
URL vs. URI vs. URN
Domain Name System (DNS)
Introduction to DNS
DNS Resolution Process
DNS Load Balancing and High Availability
Caching
Introduction to Caching
Why is Caching Important?
Types of Caching
Cache Replacement Policies
Cache Invalidation
Cache Read Strategies
Cache Coherence and Consistency Models
Caching Challenges
Cache Performance Metrics
CDN
What is CDN?
Origin Server vs. Edge Server
CDN Architecture
Push CDN vs. Pull CDN
Data Partitioning
Introduction to Data Partitioning
Partitioning Methods
Data Sharding Techniques
Benefits of Data Partitioning
Common Problems Associated with Data Partitioning
Proxies
What is a Proxy Server?
Uses of Proxies
VPN vs. Proxy Server
Redundancy and Replication
What is Redundancy?
What is Replication?
Replication Methods
Data Backup vs. Disaster Recovery
CAP & PACELC Theorems
Introduction to CAP Theorem
Components of CAP Theorem
Trade-offs in CAP Theorem
Examples of CAP Theorem in Practice
Beyond CAP Theorem
System Design Trade-offs in Interviews
Databases (SQL vs. NoSQL)
Introduction to Databases
SQL Databases
NoSQL Databases
SQL vs. NoSQL
ACID vs BASE Properties
Real-World Examples and Case Studies
SQL Normalization and Denormalization
In-Memory Database vs. On-Disk Database
Data Replication vs. Data Mirroring
Database Federation
Indexes
What are Indexes?
Types of Indexes
Bloom Filters
Introduction to Bloom Filters
Benefits & Limitations of Bloom Filters
Variants and Extensions of Bloom Filters
Applications of Bloom Filters
Difference Between Long-Polling, WebSockets, and Server-Sent Events
What is Quorum?
What is Heartbeat?
What is Checksum?
Uses of Checksum
What is Leader and Follower Pattern?
What is Security and Privacy?
What is Authentication?
What is Authorization?
Authentication vs. Authorization
OAuth vs. JWT for Authentication
What is Encryption?
What are DDoS Attacks?
Introduction to Messaging System
Introduction to Kafka
Messaging patterns
Popular Messaging Queue Systems
RabbitMQ vs. Kafka vs. ActiveMQ
Scalability and Performance
What is a Distributed File System?
Architecture of a Distributed File System
Key Components of a DFS
Batch Processing vs. Stream Processing
XML vs. JSON
Synchronous vs. Asynchronous Communication
Push vs. Pull Notification Systems
Microservices vs. Serverless Architecture
Message Queues vs. Service Bus
Stateful vs. Stateless Architecture
Event-Driven vs. Polling Architecture
Quiz
Variants and Extensions of Bloom Filters

Here are a few variants and extensions of Bloom filters:

1. Counting Bloom Filters

Counting Bloom filters extend the standard Bloom filter by using an array of counters instead of a simple bit array. This modification allows for the deletion of elements from the filter, as each counter can be incremented or decremented when elements are added or removed, respectively. However, this added functionality comes at the cost of increased storage space and complexity.

2. Compressed Bloom Filters

Compressed Bloom filters aim to reduce the storage overhead of Bloom filters by compressing the underlying bit array. Several compression techniques, such as run-length encoding or Golomb coding, can be applied to achieve a more compact representation of the filter. However, these techniques may introduce additional computational overhead during insertion and query operations.

3. Spectral Bloom Filters

Spectral Bloom filters are designed to estimate the frequency of elements in a dataset. This variant uses multiple standard Bloom filters in parallel, each representing a different frequency range. By analyzing the presence of an element across these filters, the frequency of the element can be approximated. Spectral Bloom filters can be useful in applications such as data mining or network traffic analysis.

4. Scalable Bloom Filters

Scalable Bloom filters address the issue of dynamically growing datasets by automatically adjusting the filter's size and parameters as the number of elements increases. This variant maintains a series of Bloom filters, each with different parameters, and new filters are added as required. Scalable Bloom filters can maintain a target false positive rate while accommodating an unpredictable number of elements.

5. Cuckoo Filters

Cuckoo filters are a more recent variant of Bloom filters, designed to provide similar functionality with improved space efficiency and support for element removal. Cuckoo filters use a combination of cuckoo hashing and a compact fingerprint representation of elements to achieve these benefits. In many scenarios, cuckoo filters can outperform standard Bloom filters in terms of space efficiency and overall performance.

Benefits & Limitations of Bloom Filters
Applications of Bloom Filters
Mark as Completed

On this page

  1. Counting Bloom Filters
  1. Compressed Bloom Filters
  1. Spectral Bloom Filters
  1. Scalable Bloom Filters
  1. Cuckoo Filters